New Algorithms for Delay-constrained Multicast Routing Hatem Bettahar and Abdelmadjid Bouabdallah
ثبت نشده
چکیده
The role of a delay-constrained routing protocol is to nd paths between senders and receivers subject to a delay constraint while eÆciently using network resources. Many delay-constrained routing protocols where proposed these last years, most of them give priority to cost minimization during path computing process. This approach builds paths with end-to-end delays too close to the delay constraint. We believe that such paths are risky because of the load variation and the imprecision of delay information in the network. In this paper we propose a new approach for delay-constrained routing which tries to nd the best compromise between cost minimization and the risk level regarding the delay constraint. We rst present PDCR, a Parameterised Delay-Constrained Routing protocol that implements our approach using a simple and eÆcient parameterised selection function. Then we propose three new delay-constrained multicast routing protocols based on source (Naive), destination (Greedy) and mixed multicast routing techniques. These protocols use PDCR as the underline unicast routing algorithm. Simulation results show that our protocols produce paths and trees which are stable, less risky and suitable for di erent network conditions.
منابع مشابه
A new approach for delay-constrained routing
Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We belie...
متن کاملA Delay-Constrained Protocol for Shared Multicast Tree Construction
In this paper we present a multicast protocol for building and maintaining Delay-Constrained Multi-cast Shared Trees (DCMST). Our protocol is based on the search of available Delay-Constrained multi-path to graft a new receiver to the shared tree. The new receiver chooses the most promising route regarding to its available bandwidth. This improvesthe load balancing on the network and we ooer be...
متن کاملMobility-Aware Rendezvous Point for Mobile Multicast Sources
Current multicast routing protocols have not been designed for mobile nodes and especially roaming sources. Using the remote subscription as basis, we develop a new approach based on a new entity called Mobility-aware Rendezvous Point (MRP) to hide the mobility of a mobile multicast source from the main multicast delivery tree and offer an optimal routing. The key idea of this work is to make t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002